0.07/0.11 % Problem : Vampire---4.8_3681 : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : run_E %s %d THM 0.10/0.33 % Computer : n020.cluster.edu 0.10/0.33 % Model : x86_64 x86_64 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.33 % Memory : 8042.1875MB 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.33 % CPULimit : 1440 0.10/0.33 % WCLimit : 180 0.10/0.33 % DateTime : Mon Jul 3 12:44:46 EDT 2023 0.10/0.33 % CPUTime : 0.15/0.43 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.S6tvxjuP4M/Vampire---4.8_3681 0.15/0.43 # Version: 3.1pre001-ho 0.15/0.44 # Preprocessing class: HSSSSMSSSSSNSSA. 0.15/0.44 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.15/0.44 # Starting post_as_ho12 with 180s (1) cores 0.15/0.44 # Starting new_bool_9 with 180s (1) cores 0.15/0.44 # Starting post_as_ho1 with 180s (1) cores 0.15/0.44 # Starting post_as_ho4 with 180s (1) cores 0.15/0.44 # Starting post_as_ho2 with 180s (1) cores 0.15/0.44 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.15/0.44 # Starting full_lambda_10 with 180s (1) cores 0.15/0.44 # Starting new_ho_8 with 180s (1) cores 0.15/0.44 # post_as_ho12 with pid 3860 completed with status 0 0.15/0.44 # Result found by post_as_ho12 0.15/0.44 # Preprocessing class: HSSSSMSSSSSNSSA. 0.15/0.44 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.15/0.44 # Starting post_as_ho12 with 180s (1) cores 0.15/0.44 # No SInE strategy applied 0.15/0.44 # Search class: HGUNF-FFSS32-MSSFFSBN 0.15/0.44 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.15/0.44 # Starting post_as_ho12 with 109s (1) cores 0.15/0.44 # post_as_ho12 with pid 3868 completed with status 0 0.15/0.44 # Result found by post_as_ho12 0.15/0.44 # Preprocessing class: HSSSSMSSSSSNSSA. 0.15/0.44 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.15/0.44 # Starting post_as_ho12 with 180s (1) cores 0.15/0.44 # No SInE strategy applied 0.15/0.44 # Search class: HGUNF-FFSS32-MSSFFSBN 0.15/0.44 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.15/0.44 # Starting post_as_ho12 with 109s (1) cores 0.15/0.44 # Preprocessing time : 0.001 s 0.15/0.44 # Presaturation interreduction done 0.15/0.44 0.15/0.44 # Proof found! 0.15/0.44 # SZS status Theorem 0.15/0.44 # SZS output start CNFRefutation 0.15/0.44 thf(decl_22, type, cHALF: $i > $i > $o). 0.15/0.44 thf(decl_23, type, cDOUBLE: $i > $i > $o). 0.15/0.44 thf(decl_24, type, cS: $i > $i). 0.15/0.44 thf(decl_25, type, c0: $i). 0.15/0.44 thf(decl_26, type, esk1_3: $i > $i > ($i > $i > $o) > $i). 0.15/0.44 thf(decl_27, type, esk2_3: $i > $i > ($i > $i > $o) > $i). 0.15/0.44 thf(decl_28, type, epred1_2: $i > $i > $i > $i > $o). 0.15/0.44 thf(decl_29, type, esk3_0: $i). 0.15/0.44 thf(decl_30, type, esk4_0: $i). 0.15/0.44 thf(cTHM301A, conjecture, (![X1:$i, X2:$i]:(((cDOUBLE @ X1 @ X2)=>(cHALF @ X2 @ X1)))<=(((![X1:$i, X2:$i]:(((cDOUBLE @ X1 @ X2)<=>![X3:$i > $i > $o]:(((X3 @ X1 @ X2)<=((X3 @ c0 @ c0)&![X4:$i, X5:$i]:(((X3 @ (cS @ X4) @ (cS @ (cS @ X5)))<=(X3 @ X4 @ X5))))))))&(cHALF @ c0 @ c0))&![X4:$i, X5:$i]:(((cHALF @ (cS @ (cS @ X4)) @ (cS @ X5))<=(cHALF @ X4 @ X5))))&(cHALF @ (cS @ c0) @ c0))), file('/export/starexec/sandbox/tmp/tmp.S6tvxjuP4M/Vampire---4.8_3681', cTHM301A)). 0.15/0.44 thf(c_0_1, negated_conjecture, ~(((((![X1:$i, X2:$i]:(((cDOUBLE @ X1 @ X2)<=>![X3:$i > $i > $o]:((((X3 @ c0 @ c0)&![X4:$i, X5:$i]:(((X3 @ X4 @ X5)=>(X3 @ (cS @ X4) @ (cS @ (cS @ X5))))))=>(X3 @ X1 @ X2)))))&(cHALF @ c0 @ c0))&![X4:$i, X5:$i]:(((cHALF @ X4 @ X5)=>(cHALF @ (cS @ (cS @ X4)) @ (cS @ X5)))))&(cHALF @ (cS @ c0) @ c0))=>![X1:$i, X2:$i]:(((cDOUBLE @ X1 @ X2)=>(cHALF @ X2 @ X1))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM301A])])). 0.15/0.44 thf(c_0_2, negated_conjecture, ![X15:$i, X16:$i, X17:$i > $i > $o, X20:$i, X21:$i, X23:$i, X24:$i, X25:$i, X26:$i]:(((((((((X17 @ (esk1_3 @ X15 @ X16 @ X17) @ (esk2_3 @ X15 @ X16 @ X17))|~(X17 @ c0 @ c0)|(X17 @ X15 @ X16)|~(cDOUBLE @ X15 @ X16))&(~(X17 @ (cS @ (esk1_3 @ X15 @ X16 @ X17)) @ (cS @ (cS @ (esk2_3 @ X15 @ X16 @ X17))))|~(X17 @ c0 @ c0)|(X17 @ X15 @ X16)|~(cDOUBLE @ X15 @ X16)))&((((epred1_2 @ X20 @ X21 @ c0 @ c0)|(cDOUBLE @ X20 @ X21))&(~(epred1_2 @ X20 @ X21 @ X23 @ X24)|(epred1_2 @ X20 @ X21 @ (cS @ X23) @ (cS @ (cS @ X24)))|(cDOUBLE @ X20 @ X21)))&(~(epred1_2 @ X20 @ X21 @ X20 @ X21)|(cDOUBLE @ X20 @ X21))))&(cHALF @ c0 @ c0))&(~(cHALF @ X25 @ X26)|(cHALF @ (cS @ (cS @ X25)) @ (cS @ X26))))&(cHALF @ (cS @ c0) @ c0))&((cDOUBLE @ esk3_0 @ esk4_0)&~(cHALF @ esk4_0 @ esk3_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 0.15/0.44 thf(c_0_3, negated_conjecture, ![X1:$i, X3:$i > $i > $o, X2:$i]:(((X3 @ X1 @ X2)|~((X3 @ (cS @ (esk1_3 @ X1 @ X2 @ X3)) @ (cS @ (cS @ (esk2_3 @ X1 @ X2 @ X3)))))|~((X3 @ c0 @ c0))|~((cDOUBLE @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.44 thf(c_0_4, negated_conjecture, (cDOUBLE @ esk3_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.44 thf(c_0_5, negated_conjecture, ![X1:$i, X3:$i > $i > $o, X2:$i]:(((X3 @ (esk1_3 @ X1 @ X2 @ X3) @ (esk2_3 @ X1 @ X2 @ X3))|(X3 @ X1 @ X2)|~((X3 @ c0 @ c0))|~((cDOUBLE @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.44 thf(c_0_6, negated_conjecture, ![X3:$i > $i > $o]:(((X3 @ esk3_0 @ esk4_0)|~((X3 @ (cS @ (esk1_3 @ esk3_0 @ esk4_0 @ X3)) @ (cS @ (cS @ (esk2_3 @ esk3_0 @ esk4_0 @ X3)))))|~((X3 @ c0 @ c0)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.15/0.44 thf(c_0_7, negated_conjecture, ![X1:$i, X2:$i]:(((cHALF @ (cS @ (cS @ X1)) @ (cS @ X2))|~((cHALF @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.44 thf(c_0_8, negated_conjecture, (cHALF @ c0 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.44 thf(c_0_9, negated_conjecture, ~((cHALF @ esk4_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.44 thf(c_0_10, negated_conjecture, ![X3:$i > $i > $o]:(((X3 @ (esk1_3 @ esk3_0 @ esk4_0 @ X3) @ (esk2_3 @ esk3_0 @ esk4_0 @ X3))|(X3 @ esk3_0 @ esk4_0)|~((X3 @ c0 @ c0)))), inference(spm,[status(thm)],[c_0_5, c_0_4])). 0.15/0.44 thf(c_0_11, negated_conjecture, ~((cHALF @ (esk2_3 @ esk3_0 @ esk4_0 @ (^[Z0/* 19 */:$i, Z1:$i]:((cHALF @ Z1 @ Z0)))) @ (esk1_3 @ esk3_0 @ esk4_0 @ (^[Z0/* 19 */:$i, Z1:$i]:((cHALF @ Z1 @ Z0)))))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8])]), c_0_9])). 0.15/0.44 thf(c_0_12, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_8]), c_0_9]), c_0_11]), ['proof']). 0.15/0.44 # SZS output end CNFRefutation 0.15/0.44 # Parsed axioms : 5 0.15/0.44 # Removed by relevancy pruning/SinE : 0 0.15/0.44 # Initial clauses : 14 0.15/0.44 # Removed in clause preprocessing : 4 0.15/0.44 # Initial clauses in saturation : 10 0.15/0.44 # Processed clauses : 31 0.15/0.44 # ...of these trivial : 0 0.15/0.44 # ...subsumed : 0 0.15/0.44 # ...remaining for further processing : 30 0.15/0.44 # Other redundant clauses eliminated : 0 0.15/0.44 # Clauses deleted for lack of memory : 0 0.15/0.44 # Backward-subsumed : 0 0.15/0.44 # Backward-rewritten : 0 0.15/0.44 # Generated clauses : 55 0.15/0.44 # ...of the previous two non-redundant : 42 0.15/0.44 # ...aggressively subsumed : 0 0.15/0.44 # Contextual simplify-reflections : 0 0.15/0.44 # Paramodulations : 45 0.15/0.44 # Factorizations : 0 0.15/0.44 # NegExts : 0 0.15/0.44 # Equation resolutions : 4 0.15/0.44 # Total rewrite steps : 6 0.15/0.44 # Propositional unsat checks : 0 0.15/0.44 # Propositional check models : 0 0.15/0.44 # Propositional check unsatisfiable : 0 0.15/0.44 # Propositional clauses : 0 0.15/0.44 # Propositional clauses after purity: 0 0.15/0.44 # Propositional unsat core size : 0 0.15/0.44 # Propositional preprocessing time : 0.000 0.15/0.44 # Propositional encoding time : 0.000 0.15/0.44 # Propositional solver time : 0.000 0.15/0.44 # Success case prop preproc time : 0.000 0.15/0.44 # Success case prop encoding time : 0.000 0.15/0.44 # Success case prop solver time : 0.000 0.15/0.44 # Current number of processed clauses : 20 0.15/0.44 # Positive orientable unit clauses : 5 0.15/0.44 # Positive unorientable unit clauses: 0 0.15/0.44 # Negative unit clauses : 2 0.15/0.44 # Non-unit-clauses : 13 0.15/0.44 # Current number of unprocessed clauses: 31 0.15/0.44 # ...number of literals in the above : 82 0.15/0.44 # Current number of archived formulas : 0 0.15/0.44 # Current number of archived clauses : 10 0.15/0.44 # Clause-clause subsumption calls (NU) : 5 0.15/0.44 # Rec. Clause-clause subsumption calls : 5 0.15/0.44 # Non-unit clause-clause subsumptions : 0 0.15/0.44 # Unit Clause-clause subsumption calls : 1 0.15/0.44 # Rewrite failures with RHS unbound : 0 0.15/0.44 # BW rewrite match attempts : 0 0.15/0.44 # BW rewrite match successes : 0 0.15/0.44 # Condensation attempts : 0 0.15/0.44 # Condensation successes : 0 0.15/0.44 # Termbank termtop insertions : 9962 0.15/0.44 0.15/0.44 # ------------------------------------------------- 0.15/0.44 # User time : 0.006 s 0.15/0.44 # System time : 0.003 s 0.15/0.44 # Total time : 0.009 s 0.15/0.44 # Maximum resident set size: 1696 pages 0.15/0.44 0.15/0.44 # ------------------------------------------------- 0.15/0.44 # User time : 0.006 s 0.15/0.44 # System time : 0.005 s 0.15/0.44 # Total time : 0.011 s 0.15/0.44 # Maximum resident set size: 1724 pages 0.15/0.44 % E---3.1 exiting 0.15/0.44 EOF